منابع مشابه
Degree two approximate Boolean #CSPs with variable weights
A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language Γ. We study how hard it is to evaluate this number approximately. There is an interesting partial classification, due to Dyer, Goldberg, Jalsenius and Richerby [DGJR10], of Boolean constraint languages when the degree of instances is bounde...
متن کاملApproximate Regular Expression Searching with Arbitrary Integer Weights
We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches the complexity of the best previous techniques, but it is simpler and faster in practice. In our way, we define a n...
متن کاملSequential Monte Carlo with Adaptive Weights for Approximate Bayesian Computation
Methods of Approximate Bayesian computation (ABC) are increasingly used for analysis of complex models. A major challenge for ABC is over-coming the often inherent problem of high rejection rates in the accept/reject methods based on prior:predictive sampling. A number of recent developments aim to address this with extensions based on sequential Monte Carlo (SMC) strategies. We build on this h...
متن کاملArc Weights for Approximate Evaluation of Dynamic Belief Networks
Dynamic Belief Networks (DBNs) have become a popular method for monitoring dynamical processes in real-time. However DBN evaluation has the same problems of computational intractability as ordinary belief networks, with additional exponential complexity as the number of time-slices increases. Several approximate methods for fast DBN evaluation have been devised 1, 3, 11]. We present a new metho...
متن کاملApproximate minimum norm subspace projection of least squares weights without an SVD
A QR based technique is presented for estimating the approximate numerical rank and corresponding signal subspace of a matrix together with the subspace projection of the least squares weights. Theoretical difficulties associated with conventional QR factorisation are overcome by applying the technique of RowZeroing QR to the covariance matrix. Thresholding is simplified compared with the use o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1948
ISSN: 0003-4851
DOI: 10.1214/aoms/1177730297